A Combinatory Algebra for Sequential Functionals of

نویسنده

  • Jaap van Oosten
چکیده

It is shown that the type structure of nite-type functionals associated to a combinatory algebra of partial functions from IN to IN (in the same way as the type structure of the countable functionals is associated to the partial combinatory algebra of total functions from IN to IN), is isomorphic to the type structure generated by object N (the at domain on the natural numbers) in Ehrhard's category of \dI-domains with coherence", or his \hypercoherences".

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS

A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...

متن کامل

A universal realizability model for sequential functional computation

We construct a universal and even logically fully abstract realizability model for the sequential functional programming language of call-by-name FPC. This model is defined within the category of modest sets over the total combinatory algebra L of observational equivalence classes of closed terms of the untyped programming language λ+Error. This language is untyped lazy call-by-name lambda-calc...

متن کامل

Partial Combinatory Algebras of Functions

We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley’s preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results i...

متن کامل

Sequential Fourier-feynman Transform, Convolution and First Variation

Cameron and Storvick introduced the concept of a sequential Fourier-Feynman transform and established the existence of this transform for functionals in a Banach algebra Ŝ of bounded functionals on classical Wiener space. In this paper we investigate various relationships between the sequential Fourier-Feynman transform and the convolution product for functionals which need not be bounded or co...

متن کامل

C*-algebras on r-discrete Abelian Groupoids

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals. We give a semidirect product decomposition for an abelian groupoid. This is done through a matched pair and leads to a C*-diagonal (for a special case). We use this decomposition to study ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997